A 3d Segmentation Algorithm for Ellipsoidal Shapes

نویسندگان

  • Emmanuel Soubies
  • Pierre Weiss
  • Xavier Descombes
چکیده

We propose some improvements of the Multiple Birth and Cut algorithm (MBC) in order to extract nuclei in 2D and 3D images. This algorithm based on marked point processes was proposed recently in (Gamal Eldin et al., 2012). We introduce a new contrast invariant energy that is robust to degradations encountered in fluorescence microscopy (e.g. local radiometry attenuations). Another contribution of this paper is a fast algorithm to determine whether two ellipses (2D) or ellipsoids (3D) intersect. Finally, we propose a new heuristic that strongly improves the convergence rates. The algorithm alternates between two birth steps. The first one consists in generating objects uniformly at random and the second one consists in perturbing the current configuration locally. Performance of this modified birth step is evaluated and examples on various image types show the wide applicability of the method in the field of bio-imaging.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extraction and remeshing of ellipsoidal representations from mesh data

Dense 3D polygon meshes are now a pervasive product of various modelling and scanning processes that need to be subsequently processed and structured appropriately for various applications. In this paper we address the restructuring of dense polygon meshes using their segmentation based on a number of ellipsoidal regions. We present a simple segmentation algorithm where connected components of ...

متن کامل

A Hybrid 3D Colon Segmentation Method Using Modified Geometric Deformable Models

Introduction: Nowadays virtual colonoscopy has become a reliable and efficient method of detecting primary stages of colon cancer such as polyp detection. One of the most important and crucial stages of virtual colonoscopy is colon segmentation because an incorrect segmentation may lead to a misdiagnosis.  Materials and Methods: In this work, a hybrid method based on Geometric Deformable Models...

متن کامل

Variational Segmentation Framework in Prolate Spheroidal Coordinates for 3D Real-Time Echocardiography

This paper presents a new formulation of a deformable model segmentation in prolate spheroidal coordinates for segmentation of 3D cardiac echocardiography data. The prolate spheroidal coordinate system enables a representation of the segmented surface with descriptors specifically adapted to the "ellipsoidal" shape of the ventricle. A simple data energy term, based on gray-level information, gu...

متن کامل

A Semi-Automated Algorithm for Segmentation of the Left Atrial Appendage Landing Zone: Application in Left Atrial Appendage Occlusion Procedures

Background: Mechanical occlusion of the Left atrial appendage (LAA) using a purpose-built device has emerged as an effective prophylactic treatment in patients with atrial fibrillation at risk of stroke and a contraindication for anticoagulation. A crucial step in procedural planning is the choice of the device size. This is currently based on the manual analysis of the “Device Landing Zone” fr...

متن کامل

مدل‌سازی صفحه‌ای محیط‌های داخلی با استفاده از تصاویر RGB-D

In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...

متن کامل

Automatic Segmentation of 3D Laser Point Clouds by Ellipsoidal Region Growing

We present and evaluate two variants of an algorithm for simultaneously segmenting and modeling a mixed-density unstructured 3D point cloud by ellipsoidal (Gaussian) region growing. The base algorithm merges initial ellipsoids into larger ellipsoidal segments with a minimum spanning tree algorithm. The variants differ only in the merge criterion used—a threshold on a generalised distance measur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012